package algorithm.leetcode;

/**
 * @author wuwen
 * @since 2023/12/7
 */
public class NO647_回文子串 {
    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.countSubstrings("sdfsdfs"));
    }

    static class Solution {
        public int countSubstrings(String s) {
            // todo
            return 0;
        }
    }
}